On Fast Algorithms for Two Servers
نویسندگان
چکیده
We consider 2-server algorithms with time complexity O(1) per each request. We show that the previously known algorithm BALANCE2 has competitiveness constant not better than 6, and present another algorithm whose competitiveness constant is 4.
منابع مشابه
Maximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملA New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کاملScheduling for Interactive Operations in Parallel Video Servers
Providing efficient support for interactive operations such as fast-forward and fast-backward is essential in video-on-demand and other multimedia server systems. In this paper, we present two basic approaches for scheduling interactive operations, the prefetching approach and the grouping approach. Scheduling algorithms are presented for both fine-grain and coarse-grain data blocks. These algo...
متن کاملVacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery
Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...
متن کاملAnalyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کامل